package com.ting.test.algorithms.大厂刷题班;

import com.ting.test.algorithms.递归和动态规划.从左往右的模型.纸牌问题;

public class 求Pow {

    public static void main(String[] args) {

        int count = mypow(3, 40);
    }

    private static int mypow(int x, int n) {

        int pow = n == Integer.MIN_VALUE ? n + 1 : n;

        int t = x;
        int ans = 1;
        while (pow > 0) {
            ans = ans * t;
            pow = pow >> 1;

        }

//        if(){}

        return 0;
    }
}
